Unified functional decomposition via encoding for FPGA technology mapping

نویسندگان

  • Jie-Hong Roland Jiang
  • Jing-Yang Jou
  • Juinn-Dar Huang
چکیده

Functional decomposition has recently been adopted for look-up tabel (LUT)-based field-programmable gate array (FPGA) technology mapping with good results. In this paper we propose a novel method to unify functional single-output and multiple-output decomposition. We first address a compatible class encoding algorithm to minimize the number of compatible classes in the image function. After applying the encoding algorithm, we can therefore improve the decomposability in the subsequent decomposition of the image function. The above encoding algorithm is then extended to encode multiple-output functions through the construction of a hyperfunction. Common subexpressions among these multiple-output functions can be extracted during the decomposition of the hyperfunction. Consequently, we can handle multiple-output decomposition in the same manner as single-output decomposition. Experimental results show that our algorithms are promising.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Theory on Partially-Dependent Functional Decomposition with Application in LUT-based FPGA

In this paper, we present the theory of partially-dependent functional decomposition. A partially-dependent decomposition of function produces subfunctions which do not depend on all variables in the bound set. Non-disjunctive decomposition is derived as a special case while multiple-output decomposition can be reduced to the partially-dependent functional decomposition in our theory. We develo...

متن کامل

Boolean matching for LUT-based logic blocks with applications toarchitecture evaluation and technology mapping

In this paper, we present new Boolean matching methods for lookup table (LUT)-based programmable logic blocks (PLBs) and their applications to PLB architecture evaluations and field programmable gate array (FPGA) technology mapping. Our Boolean matching methods, which are based on functional decomposition operations, can characterize functions for complex PLBs consisting of multiple LUTs (possi...

متن کامل

Technology Mapping for the Atmel Fpga Circuits

In this paper we present a technology mapping algorithm for the ATMEL 6002 FPGA circuits. The algorithm tries to balance cell utilization with the goal of producing routable mappings. The complexity of the technology mapping step may be considerably reduced if the internal representation generation is very well conceived. We implemented a program for internal representation generation, which le...

متن کامل

Post-mapping topology rewriting for FPGA area minimization

Circuit designers require Computer-Aided Design (CAD) tools when compiling designs into Field Programmable Gate Arrays (FPGAs) in order to achieve high quality results due to the complexity of the compilation tasks involved. Technology mapping is one critical step in the FPGA CAD flow. The final mapping result has significant impact on the subsequent steps of clustering, placement and routing, ...

متن کامل

Structural Gate Decomposition for Depth-Optimal Technology Mapping in LUT-based FPGA

In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the mapping solutions computed by a depth-optimal mapper have minimum depth. We present several theoretical results: (1) any further decomposition of a K-bounded network will lead to an optimal mapping depth smaller than or equal to that of the original network, regardless of the decompos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. VLSI Syst.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2001